Sequencing CONWIP flow-shops: Analysis and heuristics
نویسندگان
چکیده
منابع مشابه
Relax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملSequencing and Tabu Search Heuristics for Hybrid Flow Shops with Unrelated Parallel Machines and Setup Times
The goal of this paper is to investigate scheduling heuristics to seek the minimum of a positively weighted convex sum of makespan and the number of tardy jobs in a static hybrid flow shop environment where at least one production stage is made up of unrelated parallel machines. In addition, sequence and machine dependent setup times are considered. The problem is a combinatorial optimization p...
متن کاملIterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization
In this paper, flow shop scheduling problems with total flowtime minimization is considered. IRZ (iterative RZ, presented by Rajendran and Ziegler, EJOR, 1997) is found to be effective to improve solutions and LR (developed by Liu & Reeves, EJOR, 2001) is suitable for initial solution developing. By integrating FPE (forward pair wise exchange) and FPE-R(forward pair wise exchangerestart) with I...
متن کاملIterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops
We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job ...
متن کاملModeling and heuristics for scheduling of distributed job shops
This paper deals with the problem of distributed job shop scheduling in which the classical single-facility job shop is extended to the multi-facility one. The mathematical formulation of the problem is comprehensively discussed. Two different mixed integer linear programming models in form of sequence and position based variables are proposed. Using commercial software of CPLEX, the small size...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2001
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207540110048972